package Test_1031;

import java.util.List;

/**
 * Created with Intellij IDEA
 * Description:
 * User: 星辰
 */
public class MySingleList implements IList{
    static class ListNode{
        //元素
        public int val;
        //下一个节点
        public ListNode next;
        public ListNode(int val) {
            this.val = val;
        }
    }
    public ListNode head;
    public void createList(){
        ListNode node1=new ListNode(12);
        ListNode node2=new ListNode(34);
        ListNode node3=new ListNode(45);
        ListNode node4=new ListNode(56);
        ListNode node5=new ListNode(67);
        node1.next=node2;
        node2.next=node3;
        node3.next=node4;
        node4.next=node5;
        this.head=node1;
    }
    @Override
    public void addFirst(int data) {

          ListNode node=new ListNode(data);
          node.next=head;
          head=node;
    }

    @Override
    public void addLast(int data) {
          ListNode node=new ListNode(data);
        if(head==null){
            head=node;
            return;
        }
        ListNode cur=head;
          while(cur.next!=null){
              cur=cur.next;
          }
          cur.next=node;

    }

    @Override
    public void addindex(int index, int data) {
          int len=size();
          if(index<0 || index>len){
              System.out.println("index位置不合法");
              return;
          }
          if(index==0){
              addFirst(data);
              return;
          }
          if(index==len){
              addLast(data);
              return;
          }
          //中间插入
          ListNode cur=head;
          while(index-1!=0){
              cur=cur.next;
              index--;
          }
          ListNode node=new ListNode(data);
          node.next=cur.next;
          cur.next=node;
    }

    @Override
    public boolean contains(int key) {
        ListNode cur=head;
        while (cur!=null){
            if(cur.val==key){
                return true;
            }
            cur=cur.next;
        }
        return false;
    }

    @Override
    public void remove(int key) {
          if(head==null){
              return;
          }
          if(head.val==key){
              head=head.next;
              return;
          }
          ListNode cur=findNodeOfKey(key);
          if(cur==null){
              return;
          }
          ListNode del=cur.next;
          cur.next=del.next;
    }
    private ListNode findNodeOfKey(int key){
        ListNode cur=head;
        while(cur.next!=null){
            if(cur.next.val==key){
                return cur;
            }
            cur=cur.next;
        }
        return null;
    }

    @Override
    public void removeAllKey(int key) {
        if(head==null){
            return;
        }

        ListNode prev=head;
        ListNode cur=head.next;
        while(cur!=null){
            if(cur.val==key){
                prev.next=cur.next;
                cur=cur.next;
            }else{
                prev=cur;
                cur=cur.next;
            }
        }
        if(head.val==key){
            head=head.next;
        }
    }

    @Override
    public int size() {
        int len=0;
        ListNode cur=head;
        while(cur!=null){
            len++;
            cur=cur.next;
        }
        return len;
    }

    @Override
    public void clear() {
        ListNode cur=head;
        while(cur!=null){
            ListNode curN=null;
            cur.next=null;
            cur=curN;
        }
        head=null;
    }

    @Override
    public void display() {
        ListNode cur=head;
        while(cur!=null){
            System.out.print(cur.val+" ");
            cur=cur.next;
        }
    }
}
